Search results for "Priority queue"
showing 2 items of 2 documents
Closedness properties in team learning of recursive functions
1997
This paper investigates closedness properties in relation with team learning of total recursive functions. One of the first problems solved for any new identification types is the following: “Does the identifiability of classes U1 and U2 imply the identifiability of U1∪U2?” In this paper we are interested in a more general question: “Does the identifiability of every union of n−1 classes out of U1,...,Un imply the identifiability of U1∪...∪Un?” If the answer is positive, we call such identification type n-closed. We show that n-closedness can be equivalently formulated in terms of team learning. After that we find for which n team identification in the limit and team finite identification t…
On implicit data structures for priority queues
1985
Comparaison avec une structure liee simple et implementation de certaines structures de donnees implicites pour les files d'attente de priorite. Le minutage des experiences montre que les structures implicites sont plutot lentes